JMT’s Steady Course: Upward

Upward Spirality and Upward Planarity Testing

The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.

Evidence for the Upward Spiral Stands Steady: A Response to Heathers, Brown, Coyne, and Friedman (2015).

Commentary In 2013, we reported in Psychological Science on a longitudinal field experiment in which we randomized participants to receive positive-emotions training (or not), in order to illuminate the pathways by which positive emotions might build physical health (Kok et al., 2013). In their Commentary, Heathers, Brown, Coyne, and Friedman (2015) claim to overturn the conclusions that we and...

Uncovering Steady Advances for an Extreme Programming Course

This paper presents an empirical study about identifying improvement actions for an eXtreme Programming course in the academic environment. This exploratory study is undertaken in two preliminary phases. These phases are part of a wider research project to develop a theory about how to continuously improve courses of similar structure and content. The first phase consists of diagnosing improvem...

Steady the course: property rights in genetic material.

Computing Upward Topological Book Embeddings of Upward Planar Digraphs

This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and...